Perfect Matrix Methods
نویسندگان
چکیده
منابع مشابه
Perfect Matrix Methods
Let e¿ = (S„)jl i, A = (ei)4" j and let A be an infinite matrix which maps E into E where E is an FK-spa.ce with Schauder basis A. Necessary and sufficient conditions in terms of the matrix A are obtained for E to be dense in the summability space Ea = {3c|j43cG£} and conditions are obtained to guarantee that Ea has Schauder basis A. Finally it is shown that if weak and strong sequential conver...
متن کاملMatrix partitions of perfect graphs
Given a symmetric m by m matrix M over 0, 1, ∗, the M -partition problem asks whether or not an input graph G can be partitioned into m parts corresponding to the rows (and columns) of M so that two distinct vertices from parts i and j (possibly with i = j) are nonadjacent if M(i, j) = 0, and adjacent if M(i, j) = 1. These matrix partition problems generalize graph colourings and homomorphisms,...
متن کاملConstruction of random perfect phylogeny matrix
PURPOSE Interest in developing methods appropriate for mapping increasing amounts of genome-wide molecular data are increasing rapidly. There is also an increasing need for methods that are able to efficiently simulate such data. PATIENTS AND METHODS In this article, we provide a graph-theory approach to find the necessary and sufficient conditions for the existence of a phylogeny matrix with...
متن کاملPerfect hashing using sparse matrix packing
This article presents a simple algorithm for packing sparse 2-D arrays into minimal I-D arrays in O(r?) time. Retrieving an element from the packed I-D array is O(l). This packing algorithm is then applied to create minimal perfect hashing functions for large word lists. Many existing perfect hashing algorithms process large word lists by segmenting them into several smaller lists. The perfect ...
متن کاملA Family of Perfect Hashing Methods
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algorithms for generating order preserving minimal perfect hash functions. We show that almost all members of the family construct space and time optimal order preserving minimal perfect hash functions, and we identify the on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1971
ISSN: 0002-9939
DOI: 10.2307/2038134